Elliptic Curve Cryptography over Binary Finite Field GF(2m)

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fpga Implementation for Elliptic Curve Cryptography over Binary Extension Field

....................................................................................................................... iv DEDICATION ..................................................................................................................... v ACKNOWLEDGEMENTS ................................................................................................ vi LIST OF TABLES ..............

متن کامل

Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We present two novel algorithms for efficient implementation of field multiplication and modular reduction used frequently in an elliptic curve cryptosystem defined over GF (2). We provide a complexity study of the two algorithm...

متن کامل

Software Implementation of Elliptic Curve Cryptography over Binary Fields

This paper presents an extensive and careful study of the software implementation on workstations of the NIST-recommended elliptic curves over binary fields. We also present the results of our implementation in C on a Pentium II 400 MHz workstation.

متن کامل

Instruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2m)

The performance of elliptic curve (EC) cryptosystems depends essentially on efficient arithmetic in the underlying finite field. Binary finite fields GF(2m) have the advantage of “carry-free” addition. Multiplication, on the other hand, is rather costly since polynomial arithmetic is not supported by general-purpose processors. In this paper we propose a combined hardware/software approach to o...

متن کامل

TelosB Implementation of Elliptic Curve Cryptography over Primary Field

Even though symmetric-key scheme, which has been investigated extensively for sensor networks, can fulfill many security requirements, public-key cryptography is more flexible and simple rendering a clean interface for the security component. Against the popular belief that public key scheme is not practical for sensor networks, this paper describes a public-key implementation in a sensor netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Technology Journal

سال: 2005

ISSN: 1812-5638

DOI: 10.3923/itj.2006.204.229